An Aggregation Technique for Analysing Some Generally Distributed Stochastic Processes

A stochastic aggregation technique is developed and used to reduce generally distributed stochastic transition systems to a soluble example. By aggregating carefully, we can derive the entire stationary distribution for the original stochastic transition system. This paper examines the possibility of constructing a solution technique for generally distributed process algebras. Further, we demonstrate that by creating a stochastic transition system, we can solve G/G/1/2 queues and, more generally, Markovian Process Algebras without the use of Markov Chains.